Reduction relations for monoid semirings

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Circulations, Fuzzy Relations and Semirings

Circulations are similar to flows in capacity-constrained networks, with the difference that they also observe lower bounds and, unlike flows, are not directed from a source to a sink. We give a new description of circulations in networks using a technique introduced by Kawahara; he applied the same methods to network flows. We show the power and flexibility of his approach in a new application...

متن کامل

Planar flows and quadratic relations over semirings

Adapting Lindström’s well-known construction, we consider a wide class of functions which are generated by flows in a planar acyclic directed graph whose vertices (or edges) take weights in an arbitrary commutative semiring. We give a combinatorial description for the set of “universal” quadratic relations valid for such functions. Their specializations to particular semirings involve plenty of...

متن کامل

The monoid algebra of all relations on a finite set

We classify all the simple modules for the algebra of relations on a finite set, give their dimension, and find the dimension of the Jacobson radical of the algebra. AMS Subject Classification : 06A06, 13C05, 16B50, 16D60, 16N20, 18B05, 18B10, 18B35, 18E05.

متن کامل

Greens relations on the partition monoid and several related monoids

We describe Green’s relations on the partition monoid, two of its submonoids, and the related Jones and Brauer monoids. Key Words: partition monoid, Jones monoid, ideal structure 2000 Mathematics Subject Classi…cation: 20M20 1 The partition monoid and some submonoids The elements of the partition monoid Pn [5, 8, 9] are equivalence classes of graphs on a vertex set n [ n0 = f1; 2; :::ng [ f10; ...

متن کامل

Reduction Relations

The goal of the article is to start the formalization of Knuth-Bendix completion method (see [2], [10] or [1]; see also [11],[9]), i.e. to formalize the concept of the completion of a reduction relation. The completion of a reduction relation R is a complete reduction relation equivalent to R such that convertible elements have the same normal forms. The theory formalized in the article include...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2004

ISSN: 0747-7171

DOI: 10.1016/j.jsc.2003.07.002